An Enhanced Random Early Marking Algorithm for Internet Flow Control - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

نویسندگان

  • Sanjeewa Athuraliya
  • David Lapsley
  • Steven Low
چکیده

AbstructWe propose earlier an optimization based flow control for the Internet called Random Early Mark@ (REM). In this paper we propose and evaluate an enhancement that attempts to sped up the convergence of REM in the face of large feedback delays. REM can be regarded as an implementation of an optimization algorithm in a distributed network. The basic idea is to treat the optimization algorithm as a discrete time system and apply linear control techniques to stabilize its transient. We show that the modified algorithm is stable globally and converges exponentially locally. This algorithm translates into an enhanced REM scheme and we illustrate the performance improvement through simulation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Enhanced Random Early Marking Algorithm for Internet Flow Control

We propose earlier an optimization based flow control for the Internet called Random Early Marking (REM). In this paper we propose and evaluate an enhancement that attempts to speed up the convergence of REM in the face of large feedback delays. REM can be regarded as an implementation of an optimization algorithm in a distributed network. The basic idea is to treat the optimization algorithm a...

متن کامل

Stochastic Modeling of TCP over Lossy Links - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented. A Markovian approach is developed that allows us to study both memoryless channels (i.i.d packet loss) and channels with memory (correlated packet loss) modeled by a two state continuous time Gilbert model. The analytical results am validated against results using the...

متن کامل

A QoS-Aware Multicast Routing Protocol - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

The future Internet is expected to support multicast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in enabling new receivers to join a multicast group. However, current routing protocols are either too restrictive in their search for a feasible path between a new receiver and the multicast tree, or burden the network wit...

متن کامل

CHOKe a stateless active queue management scheme for approximating fair bandwidth allocation - INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies

We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link i s a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the Rows which submit more packets/sec than is allowed by their fair share. By ...

متن کامل

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000